Culture generating texts: functions, genres, authors

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communicative Purpose in Student Genres: Evidence from Authors and texts

Academic writing, including in English as an Academic Lingua Franca, has become a central feature for the majority of European university students. Despite a large body of research, we find that conceptualisations of student writing still tend to assume a direct link to expert academic genres, which are often explicitly evoked as models. Within a genre analytic paradigm, however, the importance...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

Generating Texts in Different Styles

Natural Language Generation (nlg) systems generate texts in English and other human languages from non-linguistic input data. Usually there are a large number of possible texts that can communicate the input data, and nlg systems must choose one of these. This decision can partially be based on style (interpreted broadly). We explore three mechanisms for incorporating style into nlg choice-maki...

متن کامل

Tutte polynomials of wheels via generating functions

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Socialʹnye i gumanitarnye znania

سال: 2020

ISSN: 2658-6231,2412-6519

DOI: 10.18255/2412-6519-2020-1-82-91